منابع مشابه
On colored designs-III: on lambda-colored H-designs, H having lambda edges
Let H be a graph having edges which has no loops and multiple edges. Complete results about the existence of colored designs CH |CK n with exactly colors, are established for 6 4 and for arbitrary when H is a matching or a star. In all cases when there is a design it can be chosen to be cyclic. Slightly less complete results are obtained when H is a path or a cycle. c © 2002 Elsevier Science B....
متن کامل06 Drawing Colored Graphs on Colored Points
Let G be a planar graph with n vertices whose vertex set is partitioned into subsets V0, . . . , Vk−1 for some positive integer 1 ≤ k ≤ n and let S be a set of n distinct points in the plane partitioned into subsets S0, . . . , Sk−1 with |Vi| = |Si| (0 ≤ i ≤ k − 1). This paper studies the problem of computing a crossing-free drawing of G such that each vertex of Vi is mapped to a distinct point...
متن کاملDrawing Colored Graphs on Colored Points
Let G be a planar graph with n vertices whose vertex set is partitioned into subsets V0, . . . , Vk−1 for a positive integer 1 ≤ k ≤ n and let S be a set of n distinct points in the plane partitioned into subsets S0, . . . , Sk−1 with |Vi| = |Si| (0 ≤ i ≤ k − 1). This paper studies the problem of computing a crossing-free drawing of G such that each vertex of Vi is mapped to a distinct point of...
متن کاملLudics without Designs I: Triads
An orthodox introduction of a paper on ludics should begin as follows. First, the authors say what ludics is commonly intended to be: typically, they would say that it is a kind of game semantics which is close to the more popular categorical game models for linear logic and PCF introduced in the last twenty years. Having set up the context, then they could informally describe ludics as an unty...
متن کاملOn Edge-Colored Graphs Covered by Properly Colored Cycles
We characterize edge-colored graphs in which every edge belongs to some properly colored cycle. We obtain our result by applying a characterization of 1-extendable graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1997
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(96)00042-8